On the Gutman index and minimum degree

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds on Gutman Index

The Gutman index (also known as Schultz index of the second kind) of a graph G is defined as Gut(G) = ∑ u,v∈V (G) d(u)d(v)d(u, v). We show that among all graphs on n vertices, the star graph Sn has minimal Gutman index. In addition, we present upper and lower bounds on Gutman index for graphs with minimal and graphs with maximal Gutman index. Corresponding author Supported by project 1M0545 of ...

متن کامل

The Multiplicative Versions of the Reciprocal Degree Distance and Reciprocal Gutman Index of Some Graph Products

In this paper, we provide exact value of the multiplicative version of the reciprocal degree distance and the multiplicative version of the reciprocal Gutman index of Cartesian product of complete graphs. Also, we establish sharp upper bounds for the multiplicative version of the reciprocal degree distance and multiplicative version of the reciprocal Gutman index of strong product of graphs.

متن کامل

degree distance and gutman index of corona product of graphs

in this paper, the degree distance and the gutman index of the corona product of two graphs are determined. using the results obtained, the exact degree distance and gutman index of certain classes of graphs are computed.

متن کامل

degree distance and gutman index of increasing trees

‎the gutman index and degree distance of a connected graph $g$ are defined as‎ ‎begin{eqnarray*}‎ ‎textrm{gut}(g)=sum_{{u,v}subseteq v(g)}d(u)d(v)d_g(u,v)‎, ‎end{eqnarray*}‎ ‎and‎ ‎begin{eqnarray*}‎ ‎dd(g)=sum_{{u,v}subseteq v(g)}(d(u)+d(v))d_g(u,v)‎, ‎end{eqnarray*}‎ ‎respectively‎, ‎where‎ ‎$d(u)$ is the degree of vertex $u$ and $d_g(u,v)$ is the distance between vertices $u$ and $v$‎. ‎in th...

متن کامل

Girth, minimum degree, independence, and broadcast independence

An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2014

ISSN: 0166-218X

DOI: 10.1016/j.dam.2014.04.004